Infinite Paths in Random Shift Graphs

نویسندگان

  • PIETRO MAJER
  • MATTEO NOVAGA
چکیده

We determine the probability tresholds for the existence of infinite paths in random shift graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone Paths in Random Hypergraphs

We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N, the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.

متن کامل

Dynamics on Unimodular Random Graphs

This paper is centered on covariant dynamics on random graphs and random networks (marked graphs), which can be described as rules to navigate the vertices that are preserved by graph/network isomorphisms. Such dynamics are referred to as vertex-shifts here. Unimodular random networks can be heuristically described as networks seen from a vertex chosen uniformly at random, both in the finite an...

متن کامل

Percolation-type Problems on Infinite Random Graphs

We study some percolation problems on the complete graph over N. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.

متن کامل

Infinite Paths in Locally Finite Graphs and in Their Spanning Trees

The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.

متن کامل

On trivial ends of Cayley graph of groups

‎In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009